Listing 1 - 4 of 4 |
Sort by
|
Choose an application
A decade has passed since Problems of Nonlinear Deformation, the first book by E.I. Grigoliuk: and V.I. Shalashilin was published. That work gave a systematic account of the parametric continuation method. Ever since, the understanding of this method has sufficiently broadened. Previously this method was considered as a way to construct solution sets of nonlinear problems with a parameter. Now it is c1ear that one parametric continuation algorithm can efficiently work for building up any parametric set. This fact significantly widens its potential applications. A curve is the simplest example of such a set, and it can be used for solving various problems, inc1uding the Cauchy problem for ordinary differential equations (ODE), interpolation and approximation of curves, etc. Research in this area has led to exciting results. The most interesting of such is the understanding and proof of the fact that the length of the arc calculated along this solution curve is the optimal continuation parameter for this solution. We will refer to the continuation solution with the optimal parameter as the best parametrization and in this book we have applied this method to variable c1asses of problems: in chapter 1 to non-linear problems with a parameter, in chapters 2 and 3 to initial value problems for ODE, in particular to stiff problems, in chapters 4 and 5 to differential-algebraic and functional differential equations.
Continuation methods --- Differential equations, Nonlinear --- Continuation methods. --- Differential equations, Nonlinear. --- Differential equations. --- Approximation theory. --- Integral equations. --- Computer mathematics. --- Mechanics. --- Ordinary Differential Equations. --- Approximations and Expansions. --- Integral Equations. --- Computational Mathematics and Numerical Analysis. --- Classical Mechanics. --- 517.91 Differential equations --- Differential equations --- Classical mechanics --- Newtonian mechanics --- Physics --- Dynamics --- Quantum theory --- Computer mathematics --- Electronic data processing --- Mathematics --- Equations, Integral --- Functional equations --- Functional analysis --- Theory of approximation --- Functions --- Polynomials --- Chebyshev systems --- Analyse numerique --- Equations differentielles
Choose an application
This book covers the main topics concerned with interpolation and approximation by polynomials. This subject can be traced back to the precalculus era but has enjoyed most of its growth and development since the end of the nineteenth century and is still a lively and flourishing part of mathematics. In addition to coverage of univariate interpolation and approximation, the text includes material on multivariate interpolation and multivariate numerical integration, a generalization of the Bernstein polynomials that has not previously appeared in book form, and a greater coverage of Peano kernel theory than is found in most textbooks. There are many worked examples and each section ends with a number of carefully selected problems that extend the student's understanding of the text. George Phillips has lectured and researched in mathematics at the University of St. Andrews, Scotland. His most recent book, Two Millenia of Mathematics: From Archimedes to Gauss (Springer 2000), received enthusiastic reviews in the USA, Britain and Canada. He is well known for his clarity of writing and his many contributions as a researcher in approximation theory.
Approximation theory. --- Numerical analysis. --- Approximation theory --- Numerical analysis --- 517.518.8 --- 517.518.8 Approximation of functions by polynomials and their generalizations --- Approximation of functions by polynomials and their generalizations --- Mathematical analysis --- Theory of approximation --- Functional analysis --- Functions --- Polynomials --- Chebyshev systems --- Mathematics. --- Approximations and Expansions. --- Numerical Analysis. --- Optics, Lasers, Photonics, Optical Devices. --- Lasers. --- Photonics. --- New optics --- Optics --- Light amplification by stimulated emission of radiation --- Masers, Optical --- Optical masers --- Light amplifiers --- Light sources --- Optoelectronic devices --- Nonlinear optics --- Optical parametric oscillators
Choose an application
Chebyshev polynomials are important in approximation theory and in the development of spectral methods for the solution of ordinary and partial differential equations. This book gives an up-to-date exposition on the theoretical and practical roles of the Chebyshev polynomials. Theoretical discussions focus on definitions and properties as well as the key formulae for generating the polynomials and computing the expressions that involve them. Practical discussions center on applications that include polynomial approximation, rational approximation, integration, integral equations, and ordinary and partial differential equations, particularly the tau and spectral methods.
Stochastic processes --- Numerical approximation theory --- Chebyshev polynomials. --- 517.58 --- 519.65 --- Chebyshev polynomials --- 517.518.8 --- Functions, Chebyshev's --- Polynomials, Chebyshev --- Tchebycheff polynomials --- Chebyshev series --- Chebyshev systems --- Orthogonal polynomials --- Special functions. Hyperbolic functions. Euler integrals. Gamma functions. Elliptic functions and integrals. Bessel functions. Other cylindrical functions. Spherical functions. Legendre polynomials. Orthogonal polynomials. Chebyshev polynomials. --- Approximation. Interpolation --- Approximation of functions by polynomials and their generalizations --- 517.518.8 Approximation of functions by polynomials and their generalizations --- 519.65 Approximation. Interpolation --- 517.58 Special functions. Hyperbolic functions. Euler integrals. Gamma functions. Elliptic functions and integrals. Bessel functions. Other cylindrical functions. Spherical functions. Legendre polynomials. Orthogonal polynomials. Chebyshev polynomials. --- Special functions. Hyperbolic functions. Euler integrals. Gamma functions. Elliptic functions and integrals. Bessel functions. Other cylindrical functions. Spherical functions. Legendre polynomials. Orthogonal polynomials. Chebyshev polynomials
Choose an application
This revised and expanded second edition presents a thorough development of the modern theory of stochastic approximation or recursive stochastic algorithms for both constrained and unconstrained problems. There is a complete development of both probability one and weak convergence methods for very general noise processes. The proofs of convergence use the ODE method, the most powerful to date. The assumptions and proof methods are designed to cover the needs of recent applications. The development proceeds from simple to complex problems, allowing the underlying ideas to be more easily understood. Rate of convergence, iterate averaging, high-dimensional problems, stability-ODE methods, two time scale, asynchronous and decentralized algorithms, state-dependent noise, stability methods for correlated noise, perturbed test function methods, and large deviations methods are covered. Many motivating examples from learning theory, ergodic cost problems for discrete event systems, wireless communications, adaptive control, signal processing, and elsewhere illustrate the applications of the theory.
Distribution (Probability theory. --- Artificial intelligence. --- Mathematics. --- Algorithms. --- Probability Theory and Stochastic Processes. --- Artificial Intelligence. --- Approximations and Expansions. --- Applications of Mathematics. --- Probabilities. --- Approximation theory. --- Applied mathematics. --- Engineering mathematics. --- Algorism --- Algebra --- Arithmetic --- Engineering --- Engineering analysis --- Mathematical analysis --- Theory of approximation --- Functional analysis --- Functions --- Polynomials --- Chebyshev systems --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Probability --- Statistical inference --- Combinations --- Mathematics --- Chance --- Least squares --- Mathematical statistics --- Risk --- Foundations --- Stochastic approximation. --- Recursive functions. --- Functions, Recursive --- Algorithms --- Logic, Symbolic and mathematical --- Number theory --- Recursion theory --- Decidability (Mathematical logic) --- Approximation theory --- Stochastic processes
Listing 1 - 4 of 4 |
Sort by
|